Minkowski Sums of Set-theoretic Models
نویسندگان
چکیده
This paper describes a new algorithm for computing Min-kowski sums of set-theoretic geometric models. The algorithm uses a variation on Woodwark's method for feature recognition. At the end of the paper we present results from an implementation of the algorithm running on two-dimensional data, and from a more experimental version ray-tracing into three-dimensional Minkowski sums to render a picture.
منابع مشابه
Minkowski sum boundary surfaces of 3D-objects
Given two solids A and B with piecewise smooth boundary we discuss the computation of the boundary Γ of the Minkowski sum A + B. This boundary surface Γ is part of the envelope when B is moved by translations defined by vectors a ∈ A, or vice versa. We present an efficient algorithm working for dense point clouds or for triangular meshes. Besides this, the global self intersections of the bound...
متن کاملContinuous penetration depth computation for rigid models using dynamic Minkowski sums
We present a novel, real-time algorithm for computing the continuous penetration depth (CPD) between two interpenetrating rigid models bounded by triangle meshes. Our algorithm guarantees gradient continuity for the penetration depth (PD) results, unlike conventional penetration depth (PD) algorithms that may have directional discontinuity due to the Euclidean projection operator involved with ...
متن کاملMinkowski Sum of Polytopes and Its Normality
In this paper, we consider the normality or the integer decomposition property (IDP, for short) for Minkowski sums of integral convex polytopes. We discuss some properties on the toric rings associated with Minkowski sums of integral convex polytopes. We also study Minkowski sums of edge polytopes and give a sufficient condition for Minkowski sums of edge polytopes to have IDP.
متن کاملAlgorithm to calculate the Minkowski sums of 3-polytopes : application to tolerance analysis
In tolerance analysis, it is necessary to check that the cumulative defect limits specified for the component parts of a product are compliant with the functional requirements expected of the product. Cumulative defect limits can be modelled using a calculated polytope, the result of a set of intersections and Minkowski sums of polytopes. This article presents a method to be used to determine f...
متن کاملCapacities , Surface Area , and Radial Sums
A dual capacitary Brunn-Minkowski inequality is established for the (n − 1)capacity of radial sums of star bodies in R. This inequality is a counterpart to the capacitary Brunn-Minkowski inequality for the p-capacity of Minkowski sums of convex bodies in R, 1 ≤ p < n, proved by Borell, Colesanti, and Salani. When n ≥ 3, the dual capacitary BrunnMinkowski inequality follows from an inequality of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994